Does Incomputable Mean Not Engineerable?
نویسنده
چکیده
Self-referential systems have some remarkable properties. The processes of life and mind are not only self-referential, but self-reference turns out to be a crucial property of both. However, they are difficult to understand. From a given starting point, both endogenous systems (self-referential natural systems) and impredicative systems (self-referential formal systems) have infinitely many logically consistent consequences. Both are incomputable; neither halts after a finite number of steps. Therefore, neither can produce an exact prediction of the behavior of the other in finitely many steps. Despite the fact that all engineering decisions are based on incomplete information, this inherent inability of an impredicative model to produce exact predictions of an endogenous system is troubling to some engineers. Nevertheless, self-reference leads to a more general, but no less rational, form of modeling than that provided by traditional reductionism. Although the mathematics of self-reference is unfamiliar to engineers, its power is dramatic. For example, it resolves the apparent paradox of how a brain/mind possessing freewill can operate in a deterministic Universe. INTRODUCTION WHY SHOULD WE CARE? Engineers seek to develop artificial systems that exhibit behaviors similar to the cognitive processes observed in biological brains. This is a worthy goal, and reaching it will be one of the crowning achievements of 21 Century technology. By no stretch of the imagination has the goal been reached yet. Indeed, the astoundingly simple nervous system of the nematode (all 300 neurons) is completely mapped out. Nevertheless, despite years of research, nobody has been able to devise an algorithm that behaves anything like a nematode (Chomsky 1993). Is it really such a stretch to suppose that the reason that the goal has not been met is that cognitive behavior is beyond the scope of the traditional reductionistic methods used by engineers? The answer to this question is yes, and this leads to another question. What other rational methods might we invoke? IMPREDICATIVE MATHEMATICAL OBJECTS What is really being said by the remarkably tricky proposition, φ(x) = φ(x)? It appears to say nothing and everything simultaneously. On the one hand, it says practically nothing. As a definition of φ(x), it does not inform us how φ(x) differs from any other entity, such as ψ(x). This one fact alone seems to illustrate the futility of
منابع مشابه
Turing Incomputable Computation
A new computing model, called the active element machine (AEM), is presented that demonstrates Turing incomputable computation using quantum random input. The AEM deterministically executes a universal Turing machine (UTM) program η with random active element firing patterns. These firing patterns are Turing incomputable when the AEM executes a UTM having an unbounded number of computable steps...
متن کاملCan Unbreakable Mean Incomputable?
Among methods of breaking a cipher, exhaustive key search stands out as the most successful (albeit the least efficient) method. We demonstrate that various algorithmic implementations of exhaustive key search are not equally effective, and cryptosystems can be devised which make some implementations of exhaustive key search unsuccessful (in the sense that the problem these algorithms try to so...
متن کاملOptimal Direct Policy Search
Hutter’s optimal universal but incomputable AIXI agent models the environment as an initially unknown probability distributioncomputing program. Once the latter is found through (incomputable) exhaustive search, classical planning yields an optimal policy. Here we reverse the roles of agent and environment by assuming a computable optimal policy realizable as a program mapping histories to acti...
متن کاملMetacomputable
The paper introduces the notion of “metacomputable” processes as those which are the product of computable processes. This notion seems interesting in the instance when metacomputable processes may not be computable themselves, but are produced by computable ones. The notion of computability used here relies on Turing computability. When we talk about something being non-computable, this can be...
متن کاملHow Random Is Quantum Randomness ? ( Extended
Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness—recently proved to be theoretically incomputable—and some well-known computable sources of pseudo-randomness. Incomputability is a necessary, but not sufficient “symptom” of “true randomness.” We base our experimental approach on algorithmic information theory which provides characterizati...
متن کامل